package com.tk.gaoji;

//管程法
public class TestPC {
    public static void main(String[] args) {
        SynContain contain = new SynContain();

        new Producer(contain).start();
        new Consumer(contain).start();
    }
}

//生产者
class Producer extends Thread {
    SynContain contain;

    public Producer(SynContain contain) {
        this.contain = contain;
    }

    @Override
    public void run() {
        for (int i = 1; i < 100; i++) {
            contain.push(new Chicken(i));
            System.out.println("生产了第" + i + "只鸡");
        }
    }
}

//消费者
class Consumer extends Thread {
    SynContain contain;

    public Consumer(SynContain contain) {
        this.contain = contain;
    }

    @Override
    public void run() {
        for (int i = 1; i < 100; i++) {
            System.out.println("消费了第-->" + contain.pop().id + "只鸡");
        }
    }
}

//产品
class Chicken {
    int id;//产品编号

    public Chicken(int id) {
        this.id = id;
    }
}

//缓冲区
class SynContain {
    //需要一个容器
    Chicken[] chickens = new Chicken[10];
    //容器计数器
    int count = 0;

    //生产者放入产品
    public synchronized void push(Chicken chicken) {
        //如果容器满了，需要等待消费者消费
        if (count == chickens.length) {
            //通知消费者消费，生产者等待
            try {
                this.wait();
            } catch (InterruptedException e) {
                e.printStackTrace();
            }
        }

        //如果没有满，我们需要丢入产品
        chickens[count] = chicken;
        count++;

        //通知消费者消费
        this.notifyAll();
    }

    //消费者消费产品
    public synchronized Chicken pop() {
        //判断是否能消费
        if (count == 0) {
            //消费者等待，生产者生产
            try {
                this.wait();
            } catch (InterruptedException e) {
                e.printStackTrace();
            }
        }
        //可以消费
        count--;
        Chicken chicken = chickens[count];
        //吃完了，通知消费者生产
        this.notifyAll();

        return chicken;
    }
}
